The average first recurrence time

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On average polynomial time

One important reason to consider average case complexity is whether all or at least some signi cant part of NP can be solved e ciently on average for all reasonable distributions Let PP comp be the class of problems which are solvable in average polynomial time for every polynomial time computable input distribution Following the framework of Levin the above question can now be formulated as Is...

متن کامل

Average Time Complexity

We extend Levin's theory of average polynomial time to arbitrary time-bounds in accordance with the following general principles: (1) It essentially agrees with Levin's notion when applied to polynomial time-bounds. (2) If a language L belongs to DTIME(T(n)), for some time-bound T (n), then every distributional problem (L;) is T on the-average. (3) If L does not belong to DTIME(T(n)) almost eve...

متن کامل

Time Average in

In this paper we study a model of ferromagnetic material governed by a nonlinear Laudau-Lifschitz equation coupled with Maxwell equations. We prove the existence of weak solutions. Then we prove that all points of the !-limit set of any trajectories are solutions of the stationary model. Furthermore we derive rigourously the quasistatic model by an appropriate time average method.

متن کامل

On Average Time Hierarchies

For a time-constructible function T we give an explicit language LT which can be recognized in time T (n). We prove that any Turing machine that recognizes LT requires time close to T (n) for most inputs, thus forming an average time hierarchy. The existence of the average time hierarchy was known, but depended on languages de ned by complicated diagonalization. We also give simple proofs for t...

متن کامل

Average Time Complexity Classes

We extend Levin's theory of average polynomial time to arbitrary time bounds and prove that average time complexity classes form as ne a hierarchy as do deterministic time complexity classes.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 1959

ISSN: 0002-9947

DOI: 10.1090/s0002-9947-1959-0106213-1